Practical Distributed Control Synthesis
نویسندگان
چکیده
Classic distributed control problems have an interesting dichotomy: they are either trivial or undecidable. If we allow the controllers to fully synchronize, then synthesis is trivial. In this case, controllers can effectively act as a single controller with complete information, resulting in a trivial control problem. But when we eliminate communication and restrict the supervisors to locally available information, the problem becomes undecidable. In this paper we argue in favor of a middle way. Communication is, in most applications, expensive, and should hence be minimized. We therefore study a solution that tries to communicate only scarcely and, while allowing communication in order to make joint decision, favors local decisions over joint decisions that require communication.
منابع مشابه
Automatic Synthesis of Distributed Systems
Automatic synthesis can be seen as a complementary approach to verification. Both approaches were proposed in the early 80s in the seminal works [10, 14]. The verification procedure needs beside a specification also a candidate model. If this candidate fails to fulfill the specification, the designer must iteratively improve the model and check it again. In automatic synthesis, the system is au...
متن کاملAutomatic synthesis of distributed transition systems
This thesis investigates the synthesis problem for two classes of distributed transition systems: synchronous products and asynchronous automata. The underlying structure of these models consist of local automata synchronizing on common actions. The synthesis problem discussed is as follows: Given a global specification as a transition system TS and a distribution pattern ∆, find a distributed ...
متن کاملControl of Modular and Distributed Discrete-Event Systems
Control of modular and distributed discrete-event systems appears as an approach to handle computational complexity of synthesizing supervisory controllers for large scale systems. For both modular and distributed discrete-event systems sufficient and necessary conditions are derived for modular control synthesis to equal global control synthesis for the supremal controllable sublanguage, for t...
متن کاملQuantitative verification and strategy synthesis for stochastic games
Design and control of computer systems that operate in uncertain, competitive or adversarial, environments can be facilitated by formal modelling and analysis. In this paper, we focus on analysis of complex computer systems modelled as turn-based 21/2-player games, or stochastic games for short, that are able to express both stochastic and non-stochastic uncertainty. We offer a systematic overv...
متن کاملDistributed Control Synthesis
Synthesis of control for distributed systems is considered to be an undecidable problem, under the assumption that control is performed by supervisors synchronizing with the original processes and selectively blocking or supporting the enabled transitions. We described a decidable distributed control problem, where additional communications are allowed between supervisors. In this way, we synth...
متن کامل